Spectral Neighbor Joining for Reconstruction of Latent Tree Models
نویسندگان
چکیده
A common assumption in multiple scientific applications is that the distribution of observed data can be modeled by a latent tree graphical model. An important example phylogenetics, where t...
منابع مشابه
Generalized neighbor-joining: more reliable phylogenetic tree reconstruction.
We have developed a phylogenetic tree reconstruction method that detects and reports multiple topologically distant low-cost solutions. Our method is a generalization of the neighbor-joining method of Saitou and Nei and affords a more thorough sampling of the solution space by keeping track of multiple partial solutions during its execution. The scope of the solution space sampling is controlle...
متن کاملSpecies tree estimation using Neighbor Joining.
Recent theoretical work has demonstrated that Neighbor Joining applied to concatenated DNA sequences is a statistically consistent method of species tree reconstruction. This brief note compares the accuracy of this approach to other popular statistically consistent species tree reconstruction algorithms including ASTRAL-II Neighbor Joining using average gene-tree internode distances (NJst) and...
متن کاملSupplemental for Spectral Algorithm For Latent Tree Graphical Models
The latent tree structure learned by the algorithm by [1] is shown in Figure 1. The blue nodes are hidden nodes and the red nodes are observed. Note how integrating out some of these hidden nodes could lead to very large cliques. Thus it is not surprising why both our spectral method and EM perform better than Chow Liu. The Chow Liu Tree is shown in Figure 1. Note how it is forced to pick some ...
متن کاملA Multi-Neighbor-Joining Approach for Phylogenetic Tree Reconstruction and Visualization
The computationally challenging problem of reconstructing the phylogeny of a set of contemporary data, such as DNA sequences or morphological attributes, was treated by an extended version of the neighbor-joining (NJ) algorithm. The original NJ algorithm provides a single-tree topology, after a cascade of greedy pairing decisions that tries to simultaneously optimize the minimum evolution and t...
متن کاملNeighbor Joining Plus - algorithm for phylogenetic tree reconstruction with proper internal nodes assignment
Most of major algorithms for phylogenetic tree reconstruction assume that sequences in the analyzed set either do not have any offspring, or that parent sequences can maximally mutate into just two descendants. The graph resulting from such assumptions forms therefore a binary tree, with all the nodes labeled as leaves. However, these constraints are unduly restrictive as there are numerous dat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM journal on mathematics of data science
سال: 2021
ISSN: ['2577-0187']
DOI: https://doi.org/10.1137/20m1365715